Scale detection via keypoint density maps in regular or near-regular textures
نویسندگان
چکیده
منابع مشابه
Scale detection via keypoint density maps in regular or near-regular textures
In this paper we propose a new method to detect the global scale of images with regular, near regular, or homogenous textures. We define texture ‘‘scale’’ as the size of the basic elements (texels or textons) that most frequently occur into the image. We study the distribution of the interest points into the image, at different scale, by using our Keypoint Density Maps (KDMs) tool. A ‘‘mode’’ v...
متن کاملSynthesis of Near-regular Natural Textures
Texture synthesis is widely used in the field of computer graphics, vision, and image processing. In the present paper, a texture synthesis algorithm is proposed for near-regular natural textures with the help of a representative periodic pattern extracted from the input textures using distance matching function. Local texture statistics is then analyzed against global texture statistics for no...
متن کاملRegular Surfaces and Regular Maps
A regular surface is a closed genus g surface defined as the tubular neighbourhood of the edge graph of a regular map. A regular map is a family of disc type polygons glued together to form a 2-manifold which is flag transitive. The visualization of this highly symmetric surface is an intriguing and challenging problem. Unlike regular maps, regular surfaces can always be visualized as 3D embedd...
متن کاملRegular Homomorphisms and Regular Maps
Regular homomorphisms of oriented maps essentially arise from a factorization by a subgroup of automorphisms. This kind of map homomorphism is studied in detail, and generalized to the case when the induced homomorphism of the underlying graphs is not valency preserving. Reconstruction is treated by means of voltage assignments on angles, a natural extension of the common assignments on darts. ...
متن کاملA comparison study of four texture synthesis algorithms on regular and near-regular textures
In this report, we compare the performance of four texture synthesis algorithms on synthesizing regular and near-regular textures. Our results show that near-regular texture synthesis remains a challenging problem. This is because a near-regular texture demonstrates both global regularity and local randomness in its texture pattern. It is difficult to preserve both properties in the synthetic t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2013
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2013.06.018